An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimization

The Barzilai–Borwein (BB) gradient method has received many studies due to its simplicity and numerical efficiency. By incorporating a nonmonotone line search, Raydan (SIAM J Optim. 1997;7:26–33) has successfully extended the BB gradient method for solving general unconstrained optimization problems so that it is competitive with conjugate gradient methods. However, the numerical results reported by Raydan are poor for very ill-conditioned problems because the effect of the degree of nonmonotonicity may be noticeable. In this paper, we focus more on the nonmonotone line search technique used in the global Barzilai–Borwein (GBB) gradient method. We improve the performance of the GBB gradient method by proposing an adaptive nonmonotone line search based on the morphology of the objective function. We also prove the global convergence and the R-linear convergence rate of the proposed method under reasonable assumptions. Finally, we give some numerical experiments made on a set of unconstrained optimization test problems of the CUTEr collection. The results show the efficiency of the proposed method in the sense of the performance profile introduced (Math Program. 2002;91:201–213) by Dolan and Moré.     

SL(n+1,R)/S(GL(1,R)×GL(n,R))上线丛的一个超几何方程

本文研究了伪黎曼对称空间SL（n+1,R）/S（GL（1,R）×GL（n,R））线丛上的微分方程.利用李代数方法,即Casimir算子得到这个微分算子.这个微分算子是一个超几何方程,这个结论推广了文献[1,3,5]中的微分方程.     

On the approximation of Laplacian eigenvalues in graph disaggregation

Graph disaggregation is a technique used to address the high cost of computation for power law graphs on parallel processors. The few high-degree vertices are broken into multiple small-degree vertices, in order to allow for more efficient computation in parallel. In particular, we consider computations involving the graph Laplacian, which has significant applications, including diffusion mapping and graph partitioning, among others. We prove results regarding the spectral approximation of the Laplacian of the original graph by the Laplacian of the disaggregated graph. In addition, we construct an alternate disaggregation operator whose eigenvalues interlace those of the original Laplacian. Using this alternate operator, we construct a uniform preconditioner for the original graph Laplacian.     

Amalgams and χ‐Boundedness

A class of graphs is hereditary if it is closed under isomorphism and induced subgraphs. A class of graphs is χ‐bounded if there exists a function such that for all graphs , and all induced subgraphs H of G, we have that . We prove that proper homogeneous sets, clique‐cutsets, and amalgams together preserve χ‐boundedness. More precisely, we show that if and are hereditary classes of graphs such that is χ‐bounded, and such that every graph in either belongs to or admits a proper homogeneous set, a clique‐cutset, or an amalgam, then the class is χ‐bounded. This generalizes a result of [J Combin Theory Ser B 103(5) (2013), 567–586], which states that proper homogeneous sets and clique‐cutsets together preserve χ‐boundedness, as well as a result of [European J Combin 33(4) (2012), 679–683], which states that 1‐joins preserve χ‐boundedness. The house is the complement of the four‐edge path. As an application of our result and of the decomposition theorem for “cap‐free” graphs from [J Graph Theory 30(4) (1999), 289–308], we obtain that if G is a graph that does not contain any subdivision of the house as an induced subgraph, then .     

双荷子系统运动的经典解

根据力学理论和经典电磁理论研究双荷子系统的运动.列出双荷子系统的运动微分方程,导出运动积分,说明系统的对称性,包括SO(4)对称性;利用变分法逆问题方法,构造双荷子系统的Lagrange(拉格朗日)函数和Hamilton(哈密顿)函数;解出双荷子系统的运动规律.     

太阳帆塔轨道和姿态耦合动力学建模及辛求解

在建立太阳帆塔太阳能电站简化模型的基础上,将系统的动力学方程从Lagrange体系导入到了Hamilton体系,给出了带约束的Hamilton正则方程;进而采用祖冲之类算法和辛Runge-Kutta方法分析了太阳帆塔轨道和姿态耦合系统的动力学特性,并讨论了算法的保能量、保约束特性;最后,数值模拟了系统的动力学特性,说明了所提方法的有效性.     

两类图的(d,1)-全标号

主要讨论了W_n与C_m的笛卡尔积和均衡完全r-部图K_r(n)的(d,1)-全标号,并得出了(d,1)-全数λ_d~T(W_n□C_m)和λ_d~T(K_(r(n)))的确切值.